Abandonment versus blocking in many-server queues: asymptotic optimality in the QED regime

نویسندگان

  • Ananda Weerasinghe
  • Avishai Mandelbaum
چکیده

We consider a controlled queueing system of the G/M/n/B +GI type, with many servers and impatient customers. The queue-capacity B is the control process. Customers who arrive to a full queue are blocked and customers who wait too long in the queue abandon. We study the tradeoff between blocking and abandonment, with cost accumulated over a random, finite time-horizon, which yields a queueing control problem (QCP). In the many-server Quality and Efficiency-Driven (QED) regime, we formulate and solve a diffusion control problem (DCP) that is associated with our QCP. The DCP solution is then used to construct asymptotically optimal controls (of the threshold type) for QCP. A natural motivation for our QCP is telephone call centers, hence the QED regime is natural as well. QCP then captures the tradeoff between busy signals and customer abandonment, and our solution specifies an asymptotically optimal number of trunk-lines.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abandonment vs. Blocking in Many-Server Queues: Asymptotic Optimality in the QED Regime

We consider a controlled queueing system of the G/M/n/B +M type, with many servers and impatient customers. The queue-capacity B is the control process. Customers who arrive to a full queue are blocked and customers who wait too long in the queue abandon. We study the tradeoff between blocking and abandonment, with cost accumulated over a random, finite time-horizon, which yields a queueing con...

متن کامل

Many-server Queues with Customer Abandonment: a Survey of Diffusion and Fluid Approximations

The performance of a call center is sensitive to customer abandonment. In this survey paper, we focus on / / G GI n GI  parallel-server queues that serve as a building block to model call center operations. Such a queue has a general arrival process (the G ), independent and identically distributed (iid) service times with a general distribution (the first GI ), and iid patience times with a g...

متن کامل

Heavy-traffic Limits for Waiting times in Many-server Queues with Abandonment

We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiencydriven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fol...

متن کامل

Heavy-traffic Limits for Waiting times in Many-server Queues with Abandonment1 by Rishi Talreja

We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fo...

متن کامل

Queues in service systems: customer abandonment and diffusion approximations

In a service system, the system performance is sensitive to customer abandonment. We focus on G/GI/n + GI parallel-server queues, which serve as a building block to model service systems. Consistent with recent empirical findings, such a queue has a general arrival process (the G) that can be time nonhomogeneous, independent and identically distributed (iid) service times with a general distrib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2013